Nominal Lawvere Theories: A category theoretic account of equational theories with names

نویسنده

  • Ranald Clouston
چکیده

Names, or object-level variables, are a ubiquitous feature in programming languages and other computational applications. Reasoning with names, and related constructs like binding and freshness, often poses conceptual and technical challenges. Nominal Equational Logic (NEL) is a logic for reasoning about equations in the presence of freshness side conditions. This paper gives a category theoretic account of NEL theories, by analogy with Lawvere’s classic correspondence between equational theories and small categories with finite products. This development reveals the abstract structure behind reasoning with equations modulo freshness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nominal Lawvere Theories

Lawvere theories provide a category theoretic view of equational logic, identifying equational theories with small categories equipped with finite products. This formulation allows equational theories to be investigated as first class mathematical entities. However, many formal systems, particularly in computer science, are described by equations modulated by side conditions asserting the “fres...

متن کامل

On the Completeness Theorem of Many-sorted Equational Logic and the Equivalence between Hall Algebras and Bénabou Theories

The completeness theorem of equational logic of Birkhoff asserts the coincidence of the model-theoretic and proof-theoretic consequence relations. Goguen and Meseguer, giving a sound and adequate system of inference rules for many-sorted deduction, founded ultimately on the congruences on Hall algebras, generalized the completeness theorem of Birkhoff to the completeness theorem of many-sorted ...

متن کامل

Category Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What?

Universal algebra is often known within computer science in the guise of algebraic specification or equational logic. In 1963, it was given a category theoretic characterisation in terms of what are now called Lawvere theories. Unlike operations and equations, a Lawvere theory is uniquely determined by its category of models. Except for a caveat about nullary operations, the notion of Lawvere t...

متن کامل

Monads of Regular Theories

We characterize the category of monads on Set and the category of Lawvere theories that are equivalent to the category of regular equational theories.

متن کامل

Electronic Notes in Theoretical Computer Science Mathematical Foundations of Programming Semantics

Universal algebra is often known within computer science in the guise of algebraic specification or equational logic. In 1963, it was given a category theoretic characterisation in terms of what are now called Lawvere theories. Unlike operations and equations, a Lawvere theory is uniquely determined by its category of models. Except for a caveat about nullary operations, the notion of Lawvere t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comput. Syst. Sci.

دوره 80  شماره 

صفحات  -

تاریخ انتشار 2014